A squaring method to simplify the decoding of orthogonal space-time block codes
نویسندگان
چکیده
In this letter, we present a squaring method to simplify the decoding of orthogonal space–time block codes in a wireless system with an arbitrary number of transmitand receive-antennas. Using this squaring method, a closed-form expression of signal-to-noise ratio after space–time decoding is also derived. It gives the same decoding performance as the maximum-likelihood ratio decoding while it shows much lower complexity.
منابع مشابه
Cooperative Orthogonal Space-Time-Frequency Block Codes over a MIMO-OFDM Frequency Selective Channel
In this paper, a cooperative algorithm to improve the orthogonal space-timefrequency block codes (OSTFBC) in frequency selective channels for 2*1, 2*2, 4*1, 4*2 MIMO-OFDM systems, is presented. The algorithm of three node, a source node, a relay node and a destination node is formed, and is implemented in two stages. During the first stage, the destination and the relay antennas receive the sym...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملA new lattice decoding for space time block codes with low complexity
We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on the Schnorr-Euchner variation of the Pohst method is used to perform the decoding of STBC. This method is shown to be substantially faster than other known sphere decoding methods. Also we exploit a fast method for decoding of orthogonal ...
متن کاملOn"A Novel Maximum Likelihood Decoding Algorithm for Orthogonal Space-Time Block Codes"
Abstract The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.
متن کاملLayered Space-Time Coding for 3×n Transmit Antenna Communication Systems
We present a new architecture of layered space-time codes as a combination of BLAST architecture and of special STTC codes which are variations about the codes first introduced by Jafarkhani et al. and named Super Orthogonal Space-Time Trellis Codes (SOSTTC). Using powerful set partitioning, these codes are able to combine the coding advantage of STTC’s together with the advantage diversity of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Communications
دوره 49 شماره
صفحات -
تاریخ انتشار 2001